A mathematical programming approach for sequential clustering of dynamic networks
نویسندگان
چکیده
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملA Sequential Method for Mathematical Programming
A sequential programming method for constrained optimization, which is referred to as SP method, is presented. It is based on a sequence of linearized constrained problems. Convergence and convergence rate of the method are analyzed based on solutions of the first order optimality conditions and on Lagrange multiplier theory. Unlike the SQP method, the SP method does not rely on an approximatio...
متن کاملSolving a new mathematical model for cellular manufacturing system: A fuzzy goal programming approach
A fuzzy goal programming-based approach is used to solve a proposed multi-objective linear programming model and simultaneously handle two important problems in cellular manufacturing systems, viz. cell formation and layout design. Considerations of intra-cell layout, the intra-cell material handling can be calculated exactly. The advantages of the proposed model are considering machining cos...
متن کاملSupply chain optimization policy for a supplier selection problem: a mathematical programming approach
Most supplier selection models consider the buyer’s viewpoint and maximize only the buyer’s profit. This does not necessarily lead to an optimal situation for all the members of a supply chain. Coordination models have been developed to optimize the entire supply chain and align the decisions between its entities. Little research has been done on the application of these models in the supplie...
متن کاملclustering.sc.dp: Optimal Clustering with Sequential Constraint by Using Dynamic Programming
The general clustering algorithms do not guarantee optimality because of the hardness of the problem. Polynomial-time methods can find the clustering corresponding to the exact optimum only in special cases. For example, the dynamic programming algorithm can solve the one-dimensional clustering problem, i.e., when the items to be clustered can be characterised by only one scalar number. Optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2016
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2015-60656-5